Experimental loss-tolerant quantum coin flipping
نویسندگان
چکیده
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this problem can be alleviated, although partial bias remains. Unfortunately, practical systems are subject to loss of quantum data, which allows a cheater to force a bias that is complete or arbitrarily close to complete in all previous protocols and implementations. Here we report on the first experimental demonstration of a quantum coin-flipping protocol for which loss cannot be exploited to cheat better. By eliminating the problem of loss, which is unavoidable in any realistic setting, quantum coin flipping takes a significant step towards real-world applications of quantum communication.
منابع مشابه
Quantum coin flipping with arbitrary small bias is impossible
Lo and Chau [7] showed that ideal quantum coin flipping protocol is impossible. The proof was simply derived from the impossibility proof of quantum bit commitment [7, 8]. However, the proof still leaves the possibility of quantum coin flipping protocol with arbitrary small bias. In this paper, we show that quantum coin flipping protocol with arbitrary small bias is impossible and show the lowe...
متن کاملSerial composition of quantum coin flipping and bounds on cheat detection for bit commitment
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in th...
متن کاملTight Bounds for Classical and Quantum Coin Flipping
Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a tight bound on the range of implementable unconditionally secure coin flips, both in the classical as well as in the quantum setting and for both weak as we...
متن کاملA Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kita...
متن کاملar X iv : 0 90 3 . 31 18 v 1 [ qu an t - ph ] 1 8 M ar 2 00 9 Generation of a Common Reference String , secure against Quantum Adversaries , and Applications
In this paper, we present the generation of a common reference string “from scratch” via coin-flipping in the presence of a quantum adversary. First, we present how we achieve quantumsecure coin-flipping using Watrous’ quantum rewinding technique [Wat06]. Then, by combining this coin-flipping with any non-interactive zero-knowledge protocol we get an easy transformation from non-interactive zer...
متن کامل